Modified T-F Function Method for Finding Global Minimizer on Unconstrained Optimization

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modified T-F Function Method for Finding Global Minimizer on Unconstrained Optimization

This paper indicates that the filled function which appeared in one of the papers by Y. L. Shang et al. 2007 is also a tunneling function; that is, we prove that under some general assumptions this function has the characters of both tunneling function and filled function. A solution algorithm based on this T-F function is given and numerical tests from test functions show that our T-F function...

متن کامل

A New T-F Function Approach for Discrete Global Optimization

The T-F function method is an approach to find the global minimum of a multidimensional function. This paper gives a new definition of T-F function for discrete global optimization. A T-F function satisfying this definition is proposed. Furthermore, we discuss the properties of the proposed T-F function and design a new discrete T-F function algorithm. Numerical results on several test problems...

متن کامل

A Modified Regularized Newton Method for Unconstrained Nonconvex Optimization

In this paper, we present a modified regularized Newton method for the unconstrained nonconvex optimization by using trust region technique. We show that if the gradient and Hessian of the objective function are Lipschitz continuous, then the modified regularized Newton method (M-RNM) has a global convergence property. Numerical results show that the algorithm is very efficient.

متن کامل

A Modified Conjugate Gradient Method for Unconstrained Optimization

Conjugate gradient methods are an important class of methods for solving unconstrained optimization problems, especially for large-scale problems. Recently, they have been studied in depth. In this paper, we further study the conjugate gradient method for unconstrained optimization. We focus our attention to the descent conjugate gradient method. This paper presents a modified conjugate gradien...

متن کامل

The modified BFGS method with new secant relation ‎for unconstrained optimization problems‎

Using Taylor's series we propose a modified secant relation to get a more accurate approximation of the second curvature of the objective function. Then, based on this modified secant relation we present a new BFGS method for solving unconstrained optimization problems. The proposed method make use of both gradient and function values while the usual secant relation uses only gradient values. U...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Problems in Engineering

سال: 2010

ISSN: 1024-123X,1563-5147

DOI: 10.1155/2010/602831